Rewrite Theories to Temporal

نویسنده

  • Grit Denker
چکیده

The work presented here aims at bridging the gap between executable speciications and formal veriication. In this paper we combine two levels of description without changing the framework. The operational level of Maude/rewriting logic and the property-oriented level of temporal logics are combined. The combination is done by an embedding. We propose a distributed temporal logic as an extension of rewriting logic. Rewriting logic is primarily a logic of change in which the deduction directly corresponds to the computation. In contrast to that, temporal logic is a logic to talk about change in a global way. Especially, more complex system properties such as safety and liveness can be regarded in a temporal logic setting. In our approach we maintain the possibility of executing Maude speciications on the rewrite machine for validation purposes, and add the possibility of formally reasoning about Maude speciications in a temporal logic setting. The work presented focuses on object-oriented Maude speciications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Rewrite Theories

We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabi...

متن کامل

A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting

This paper presents a model checker for LTLR, a subset of the temporal logic of rewriting TLR∗ extending linear temporal logic with spatial action patterns. Both LTLR and TLR∗ are very expressive logics generalizing well-known state-based and action-based logics. Furthermore, the semantics of TLR∗ is given in terms of rewrite theories, so that the concurrent systems on which the LTLR properties...

متن کامل

Probabilistic Rewrite Theories: Unifying Models, Logics and Tools

Probabilistic rewrite theories are proposed as a general semantic framework that unifies many existing models of probabilistic systems for both discrete and continuous time and suggests new models such as probabilistic hybrid systems. Probabilistic temporal logics for existing models are likewise unified in two logics, namely PRTL and PRTL∗ that we develop. Having a common semantic framework en...

متن کامل

Proving Safety Properties of Rewrite Theories

Rewriting logic theories are a general and expressive way of specifying concurrent systems, where states are axiomatized by equations and transitions among states are axiomatized by rewrite rules. In this paper, we present a transfor-mational and reductionistic deductive approach for verifying safety properties of rewrite theories. In our approach all formal temporal reasoning about concurrent ...

متن کامل

PVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool

Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical model checking, and making such scalability of analysis available to tools like Maude, where probabilistic systems can be specified at a high le...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998